#define _CRT_SECURE_NO_WARNINGS 1
lass Solution{
public:
    int maxValue(vector<vector<int>>&grid) {
        int m = grid.size();
        int n = grid[0].size();
        vector<vector<int>> dp(m + 1,vector<int>(n + 1));
        for (int i = 1; i < m + 1; i++)
        {
            for (int j = 1; j < n + 1; j++)
            {
                dp[i][j] = max(dp[i - 1][j],dp[i][j - 1]) + grid[i - 1][j - 1];
            }
        }
        return dp[m][n];

    }
};